General vertex disjoint paths in series-parallel graphs
نویسندگان
چکیده
منابع مشابه
Vertex Disjoint Paths in Upward Planar Graphs
The k-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed k when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter k) on this restricted class. Only recently, [1...
متن کاملIntersection graphs of vertex disjoint paths in a tree
Two characterizations of intersection graphs of vertex disjoint paths in a tree, one in terms of maximal clique separator and the other in terms of minimal forbidden subgraphs, are presented. A polynomial recognition algorithm for this class is suggested.
متن کاملFour Shortest Vertex-Disjoint Paths in Planar Graphs
Let G be an edge-weighted planar graph with 2k terminal vertices 5 s1, t1, . . . , sk, tk. The minimum-sum vertex-disjoint paths problem asks for a set of 6 pairwise vertex-disjoint simple paths of minimum total length, where the ith path 7 connects si to ti. Even when all terminals lie on a single face, efficient algorithms 8 for this problem are known only for fixed k ≤ 3. We describe the fir...
متن کاملConstructing vertex-disjoint paths in (n, k)-star graphs
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n 1 between any pair of vertices in an (n, k)-star graph with connectivity n 1. Since the wide diameters in an (n, n 1)-star graph and an (n, 1)-star graph have been derived by Lin et al. (2004), this work only addresses an (n, k)-star with 2 k n 2. The length of the longest ...
متن کاملLongest Paths in Series-Parallel Graphs
In 1966 Gallai asked whether all longest paths in a connected graph intersect in a common vertex. This is not true in general and various counterexamples have been found. However, many well-known classes of graphs have the socalled Gallai property, e.g. trees and outerplanar graphs. Recently, de Rezende et al. proved that 2-trees, which are maximal series-parallel graphs, also have this propert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90035-m